Scope and Abstraction : Two Criteria for Localized

Localization is a general-purpose representational technique for partitioning a problem into subprob-lems. A localized problem-solver searches several smaller search spaces, one for each subproblem. Unlike most methods of partitioning, however, localiza-tion allows for subproblems that overlap { i.e. multiple search spaces may be involved in constructing shared pieces of the overall plan. In this paper we focus on two criteria for forming localizations: scope and abstraction. We describe a method for automatically generating such localizations and provide empirical results that contrast their use in an ooce-building construction domain.